A Comparison of Global EDF and LLREF Scheduling Algorithms
نویسندگان
چکیده
In this paper we are going to analyze and trying to compare EDF and LLREF scheduling algorithms, used in multiprocessor platforms. We will briefly describe classic EDF, global EDF, which is an extension of EDF, and the newer LLREF algorithm. Then we will analyze the ability of global EDF in scheduling task sets in random manner and compare with the LLREF one, which can schedule any task set when the total utilization is smaller then number of processors. We will examine optimally and the overhead of these two algorithms. Analyzing three parameters such as: schedulability, task migration and scheduler invocations, we will try to be as specific as possible with our conclusions.
منابع مشابه
A Comparison of Global and Partitioned EDF Schedulability Tests for Multiprocessors TR-051101
This paper compares the performance of several variations on EDF-based global and partitioned multiprocessor scheduling algorithms, together with their associated feasibility tests, on a variety of pseudo-randomly chosen sets of sporadic tasks. A new hybrid EDF-based scheme is shown to perform better than previously studied priority-based global scheduling schemes, though not as well as EDF-bas...
متن کاملAn Evaluation of the RUN Algorithm in LITMUS
Existing multiprocessor real-time scheduling algorithms follow partitioning/global scheduling approaches or some hybrid approaches of the two. Under partitioning, all tasks are assigned to specific processors. Under global scheduling, tasks may migrate among processors. Global scheduling has the advantage of better schedulability compared to partitioning. However, optimal algorithms based on gl...
متن کاملComparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor
Multiprocessor architecture becomes common on realtime systems as the workload of real-time systems increases. Recently new deadline-based (EDF-based) multiprocessor scheduling algorithms are devised, and comparative studies on the performance of these algorithms are necessary. In this paper, we compare EDZL, a hybrid of EDF and LLF, with other deadline-based scheduling algorithms such as EDF, ...
متن کاملEvaluation of Scheduling Algorithms for Real-Time Disk I/O
Real-time disk I/O scheduling is extremely important to the performance improvement of the whole real-time system since the disk devices are the system’s bottleneck. To meet time constraints, some conventional algorithm, such as EDF, Least Slack Time First, Rate Monotonic, can be used to schedule disk I/O. However, these algorithms ignore the relative position of requested data on the disks, he...
متن کاملComparison of Empirical Success Rates of Global vs. Partitioned Fixed-Priority and EDF Scheduling for Hard Real Time TR-050601
Improvements in schedulability tests for global fixed-priority and EDF scheduling in a homogeneous multiprocessor (symmetric multiprocessing) environment have shown that the worst-case guaranteed achievable utilization levels for global EDF scheduling equals what can be achieved with partitioned scheduling, and both ways of applying EDF scheduling out-perform fixed-priority scheduling, for sets...
متن کامل